Pii: 0097-3165(90)90066-6
نویسنده
چکیده
We introduce several analogs of the Robinson-Schensted algorithm for skew Young tableaux. These correspondences provide combinatorial proofs of various identities involving f&,, the number of standard skew tableaux of shape L/p, and the skew Schur functions So..,,. For example, we are able to show bijectively that and 4 S;&)QdY)=C ~p;p(x)~~,p(Y) n (1-%Y,)Y. P 1. I It is then shown that these new algorithms enjoy some of the same properties as the original. In particular, it is still true that replacing a permutation by its inverse exchanges the two output tableaux. This fact permits us to derive a number of other identities as well. 0 1990 Academic Press. Inc.
منابع مشابه
Unimodality and Young's lattice
Young’s lattice of a partition λ consists of all partitions whose Ferrers diagrams fit inside λ. Several infinite families of partitions are given whose Young’s lattice is not rank unimodal. Some related problems are discussed.
متن کاملOrthogonal tableaux and an insertion algorithm for SO(2n + 1)
A new set of tableaux indexing the weights of the irreducible representations of SO(2n + 1) is presented. These tableaux are used to produce an insertion scheme which gives a combinatorial description of the decomposition of the kth tensor power of the natural action of SO(2n + I ) into irreducibles. In particular, the multiplicities in this decomposition are described explicitly. C 1990 Academ...
متن کاملTaxonomic classes of sets
A taxonomic class is a family of nonempty sets such that either every two of its sets are disjoint or one is contained in the other. A complete taxonomic class is one in which every set is the union of the minimal sets contained in it. A connected taxonomic class has exactly one maximal set. The main results are exact and asymptotic formulas for the number of these classes and maximal taxonomic...
متن کامل